Observing Success in the Pi-Calculus
نویسندگان
چکیده
A contextual semantics – defined in terms of successful termination and mayand shouldconvergence – is analyzed in the synchronous pi-calculus with replication and a constant Stop to denote success. The contextual ordering is analyzed, some nontrivial process equivalences are proved, and proof tools for showing contextual equivalences are provided. Among them are a context lemma and new notions of sound applicative similarities for mayand should-convergence. A further result is that contextual equivalence in the pi-calculus with Stop conservatively extends barbed testing equivalence in the (Stop-free) pi-calculus and thus results on contextual equivalence can be transferred to the (Stop-free) pi-calculus with barbed testing equivalence. 1998 ACM Subject Classification F.3.2 Semantics of Programming Languages, D.3.1 Formal Definitions and Theory F.4.2 Grammars and Other Rewriting Systems,
منابع مشابه
Contextual Equivalence for the Pi-Calculus that can Stop
The pi-calculus is a well-analyzed model for mobile processes and mobile computations. While a lot of other process and lambda calculi that are core languages of higher-order concurrent and/or functional programming languages use a contextual semantics observing the termination behavior of programs in all program contexts, traditional program equivalences in the pi-calculus are bisimulations an...
متن کاملDesign and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملWS-CDL and Pi-Calculus
With the publishing and creation of the Web Services Description Language (WS-CDL) and the success of the Pi Calculus it has been stated that the former is based on the latter. A well reasoned answer for or against this claim is not to be found. Here an approach to a well reasoned answer is portrayed and criteria on how to evaluate this statement are presented. An investigation of the relations...
متن کاملA New-type Pi Calculus with Buffers and Its Bisimulation
According to the features of asynchronous interaction in systems, a new-type Pi calculus with buffers — Buffer-Pi calculus is proposed, the new labelled transition system based on buffers is introduced, the enhanced describing capability is shown to apply Buffer-Pi calculus to modeling with the concrete example of asynchronous interaction, and the new behavior equivalence relations are defined,...
متن کاملSynchrony vs Causality in the Asynchronous Pi-Calculus
We study the relation between process calculi that differ in their either synchronous or asynchronous interaction mechanism. Concretely, we are interested in the conditions under which synchronous interaction can be implemented using just asynchronous interactions in the π-calculus. We assume a number of minimal conditions referring to the work of Gorla: a “good” encoding must be compositional ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015